An Attraction Map Framework of a Complex Multi-Echelon Vehicle Routing Problem with Random Walk Analysis

The paper aims to investigate the basin of attraction map a complex Vehicle Routing Problem with random walk analysis. (VRP) is common discrete optimization problem in field logistics. In case base VRP, positions one single depot and many customers (which have product demands) are given. vehicles their capacity limits also fixed system objective function minimization length route. literature, approaches appeared simulate transportation demands. Most using some kind metaheuristics. Solving problems metaheuristics requires exploring fitness landscape problem. analysis consists investigation following elements: set possible states, neighborhood relationship. We use used perform discovery depending on interpretation. this article, operators for map: 2-opt, Order Crossover (OX), Partially Matched (PMX), Cycle (CX). Based our test results, 2-opt more efficient than Crossovers.